Parallel tetrahedral mesh adaptation with dynamic load balancing
نویسندگان
چکیده
منابع مشابه
Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing 1
The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing azl edge-based adaptation scheme, called 3D_TAG, using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However, performance det...
متن کاملParallel tetrahedral mesh adaptation with dynamic load balancing
The ability to dynamically adapt an unstructured grid is a powerful tool for ef-ciently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D TAG, using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly reened. However, performance deteri...
متن کاملDynamic Load Balancing for Parallel Mesh Adaptation
Computational fluid dynamics (CFD) flow simulations are extremely expensive in terms of CPU time and memory. In this study, parallel computing and grid adaptation techniques are employed to achieve high efficiency and accuracy in a hybrid unstructured flow solver. However, adaptive local grid refinement/coarsening causes the unequal distribution of workload among the processors at run time. A s...
متن کاملDynamic Load Balancing for Parallel Adaptive Mesh Refinement
A key step in the nite element method is to generate a high quality mesh that is as small as possible for an input domain. Several meshing methods and heuristics have been developed and implemented. Methods based on advancing front, Delaunay triangulations, and quadtrees/octrees are among the most popular ones. Advancing front uses simple data structures and is eecient. Unfortunately, in genera...
متن کاملImproved Parallel Mesh Generation Through Dynamic Load-Balancing
Parallel mesh generation is an important feature of any large distributed memory parallel computational mechanics code due to the need to ensure that (i) there are no sequential bottlenecks within the code, (ii) there is no parallel overhead incurred in partitioning an existing mesh and (iii) that no single processor is required to have enough local memory to be able to store the entire mesh. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2000
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(00)00047-8